Automatable High-Level Integration of Constraint Programs

We propose a reformulation algorithm as well as a set of re-formulation rules for models of constraint satisfaction problems written in our high-level constraint programming language esra, which is more expressive than opl and is compiled into opl. For the class of mapping problems, the reformulation algorithm achieves models that integrate a constraint programming formulation and an integer programming formulation while the esra-to-esra reformulation rules achieve models that integrate primal variables with dual variables and infer the appropriate channelling constraints.